Cryptography C 1 . Finding
ثبت نشده
چکیده
منابع مشابه
Quantum Factoring and Search Algorithms
Quantum Factoring and Search Algorithms Quantum Information Seminar Friday, Sep. 17, 1999 Ashok Muthukrishnan Rochester Center for Quantum Information (RCQI) ___________________________________________________________ § 1. Quantum Algorithm for Factorisation (1994) A. Factorising and cryptography p. 2 B. Relation of factorisation to period-finding p. 5 C. Quantum algorithm for period-finding p....
متن کاملAn Introduction to Differential Computation Analysis (DCA) on the withe-box cryptography algorithms
Advances in information and communication technologies lead to use of some new devices such as smart phones. The new devices provide more advantages for the adversaries hence with respect to them, one can define with-box cryptography. In this new model of cryptography, designers try to hide the key using as a kind of implementation. The Differential Computation Analysis (DCA) is a side channel ...
متن کاملمطالعهای بر رمزنگاری بصری و ارائهی روش پیشنهادی برای رمزنگاری تصاویر رنگی
Visual cryptography is a method that makes use of the characteristics of human vision and it requires neither the knowledge of cryptography nor the complex calculations. This method was first proposed by Naor and Shamir, its implementation is simple, it has been extended to an secrect sharing (k, n) in which n shares are made from the image and they are distributed among n participants. Moreov...
متن کاملCone Dependence - A Basic Combinatorial Concept
We call A ⊂ En cone independent of B ⊂ En , the euclidean n-space, if no a = (a1, . . . , an) ∈ A equals a linear combination of B \ {a} with non-negative coefficients. If A is cone independent of A we call A a cone independent set. We begin the analysis of this concept for the sets P(n) = {A ⊂ {0, 1}n ⊂ En : A is cone independent} and their maximal cardinalities c(n) max{|A| : A ∈ P(n)}. We sh...
متن کاملComparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کامل